Multilayer Structured NMF for Spectral Unmixing of Hyperspectral Images

One of the challenges in hyperspectral data analysis is the presence of mixed pixels. Mixed pixels are the result of low spatial resolution of hyperspectral sensors. Spectral unmixing methods decompose a mixed pixel into a set of endmembers and abundance fractions. Due to nonnegativity constraint on abundance fraction values, NMF based methods are well suited to this problem. In this paper multilayer NMF has been used to improve the results of NMF methods for spectral unmixing of hyperspectral data under the linear mixing framework. Sparseness constraint on both spectral signatures and abundance fractions matrices are used in this paper. Evaluation of the proposed algorithm is done using synthetic and real datasets in terms of spectral angle and abundance angle distances. Results show that the proposed algorithm outperforms other previously proposed methods.Comment: 4 pages, conferenc

On-Line Object Feature Extraction for Multispectral Scene Representation

This thesis investigates a new on-line unsupervised object-feature extraction method that reduces the complexity and costs associated with the analysis of the multispectral image data and the data transmission, storage, archival and distribution as well. Typically in remote sensing a scene is represented by the spatially disjoint pixel-oriented features. It would appear possible to reduce data redundancy by an on-line unsupervised object-feature extraction process, where combined spatial-spectral object\u27s features, rather than the original pixel-features, are used for multispectral scene representation. The ambiguity in the object detection process can be reduced if the spatial dependencies, which exist among the adjacent pixels, are intelligently incorporated into the decision making process. We define the unity relation that must exist among the pixels of an object. The unity relation can be constructed with regard to the: adjacency relation, spectral-feature and spatial-feature characteristics in an object; e.g. AMICA (Automatic Multispectral Image Compaction Algorithm) uses the within object pixel feature gradient vector as a valuable contextual information to construct the object\u27s features, which preserve the class separability information within the data. For on-line object extraction, we introduce the path-hypothesis, and the basic mathematical tools for its realization are introduced in terms of a specific similarity measure and adjacency relation. AMICA is an example of on-line preprocessing algorithm that uses unsupervised object feature extraction to represent the information in the multispectral image data more efficiently. As the data are read into the system sequentially, the algorithm partitions the observation space into an exhaustive set of disjoint objects simultaneously with the data acquisition process, where, pixels belonging to an object form a path-segment in the spectral space. Each path-segment is characterized by an object-feature set. Then, the set of object-features, rather than the original pixel-features, is used for data analysis and data classification. AMICA is applied to several sets of real image data, and the performance and reliability of features is evaluated. Example results show an average compaction coefficient of more than 20/1 (this factor is data dependent). The classification performance is improved slightly by using object-features rather than the original data, and the CPU time required for classification is reduced by a factor of more than 20 as well. The feature extraction process may be implemented in real time, thus the object-feature extraction CPU time is neglectable; however, in the simulated satellite environment the CPU time for this process is less than 15% of CPU time for original data classification

Feature reduction of hyperspectral images: Discriminant analysis and the first principal component

When the number of training samples is limited, feature reduction plays an important role in classification of hyperspectral images. In this paper, we propose a supervised feature extraction method based on discriminant analysis (DA) which uses the first principal component (PC1) to weight the scatter matrices. The proposed method, called DA-PC1, copes with the small sample size problem and has not the limitation of linear discriminant analysis (LDA) in the number of extracted features. In DA-PC1, the dominant structure of distribution is preserved by PC1 and the class separability is increased by DA. The experimental results show the good performance of DA-PC1 compared to some state-of-the-art feature extraction methods

Nonminutiae-Based Decision-Level Fusion for Fingerprint Verification

Most of the proposed methods used for fingerprint verification are based on local visible features called minutiae. However, due to problems for extracting minutiae from low-quality fingerprint images, other discriminatory information has been considered. In this paper, the idea of decision-level fusion of orientation, texture, and spectral features of fingerprint image is proposed. At first, a value is assigned to the similarity of block orientation field of two-fingerprint images. This is also performed for texture and spectral features. Each one of the proposed similarity measure does not need core-point existence and detection. Rotation and translation of two fingerprint images are also taken into account in each method and all points of fingerprint image are employed in feature extraction. Then, the similarity of each feature is normalized and used for decision-level fusion of fingerprint information. The experimental results on FVC2000 database demonstrate the effectiveness of the proposed fusion method and its significant accuracy